Simple Multireader Registers using Time-Stamp Schemes
نویسندگان
چکیده
We use the theory of time-stamp schemes to implement an atomic 1-writer n-reader variable (register) from n 2 atomic 1-writer 1-reader variables, using bounded time-stamps. The number of time-stamps needed is (2n +2)2 , so this scheme uses O (n 2log n) control bits altogether. The construction is simple, transparant and optimal in worst-case number of control bits per subvariable. No other previous method did better than Ω(n) control bits per atomic subregister in the worst case, so in that measure we present a multiplicative O (n/ log n) improvement. A similar scheme is given that uses only 2-bit variables written by readers, and 2n-bit variables written by the writer. This uses altogether O (n 2) control bits altogether. This scheme is optimal in worst-case overal number of control bits. Apart from being optimal in several ways, our constructions add an intuitive dimension which lacks in previous algorithms for this problem. We want to stress that it is really much simpler than previous such algorithms. 1980 Mathematics Subject Classification: 68C05, 68C25, 68A05, 68B20. CR Categories: B.3.2, B.4.3, D.4.1., D.4.4.
منابع مشابه
Bounded Concurrent Time-Stamping
We introduce concurrent time-stamping, a paradigm that allows processes to temporally order concurrent events in an asynchronous shared-memory system. Concurrent time-stamp systems are powerful tools for concurrency control, serving as the basis for solutions to coordination problems such as mutual exclusion, `-exclusion, randomized consensus, and multiwriter multireader atomic registers. Unfor...
متن کامل2 3 O ct 2 00 2 Simple Wait - free Multireader Registers
Multireader shared registers are basic objects used as communication medium in asynchronous concurrent computation. We propose a surprisingly simple and natural scheme to obtain several waitfree constructions of bounded 1-writer multireader registers from atomic 1-writer 1-reader registers, that is easier to prove correct than any previous construction. Our main construction is the first symmet...
متن کاملSimple Optimal Wait-free Multireader Registers
Multireader shared registers are basic objects used as communication medium in asynchronous concurrent computation. We propose a surprisingly simple and natural scheme to obtain several wait-free constructions of bounded 1-writer multireader registers from atomic 1-writer 1-reader registers, that is easier to prove correct than any previous construction. Our main construction is the first symme...
متن کاملOptimal Wait-free Multireader Registers
Multireader shared registers are basic objects used as communication medium in asynchronous concurrent computation. We propose a scheme to obtain several wait-free constructions of bounded 1-writer multireader registers from atomic 1-writer 1-reader registers, that is easy to prove correct. Our main construction is the first one that is optimal with respect to the worstcase local use of control...
متن کامل